Solving #SAT and Bayesian Inference with Backtracking Search
نویسندگان
چکیده
منابع مشابه
Solving #SAT and Bayesian Inference with Backtracking Search
Inference in Bayes Nets (BAYES) is an important problem with numerous applications in probabilistic reasoning. Counting the number of satisfying assignments of a propositional formula (#SAT) is a closely related problem of fundamental theoretical importance. Both these problems, and others, are members of the class of sum-of-products (SUMPROD) problems. In this paper we show that standard backt...
متن کاملValue Elimination: Bayesian Inference via Backtracking Search
We present Value Elimination, a new algorithm for Bayesian Inference. Given the same variable order ing information, Value Elimination can achieve per formance that is within a constant factor of variable elimination or recursive conditioning, and on some problems it can perform exponentially better, irrespec tive of the variable ordering used by these algorithms. Value Elimination's other f...
متن کاملValue Elimination: Bayesian Interence via Backtracking Search
We present Value Elimination, a new algorithm for Bayesian Inference. Given the same variable ordering information, Value Elimination can achieve performance that is within a constant factor of variable elimination or recursive conditioning, and on some problems it can perform exponentially better, irrespective of the variable ordering used by these algorithms. Value Elimination’s other feature...
متن کاملVariational Bayesian Inference with Stochastic Search
Mean-field variational inference is a method for approximate Bayesian posterior inference. It approximates a full posterior distribution with a factorized set of distributions by maximizing a lower bound on the marginal likelihood. This requires the ability to integrate a sum of terms in the log joint likelihood using this factorized distribution. Often not all integrals are in closed form, whi...
متن کاملSolving Many-Valued SAT Encodings with Local Search
In this paper we present MV-SAT, which is a many-valued constraint programming language that bridges the gap between Boolean Satisfiability and Constraint Satisfaction. Our overall goal is to extend the SAT formalism with many-valued sets and deal with more compact and natural encodings, as in CSP approaches, while retaining the efficiencies of SAT solvers operating on uniform encodings. After ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2009
ISSN: 1076-9757
DOI: 10.1613/jair.2648